全文获取类型
收费全文 | 4099篇 |
免费 | 287篇 |
国内免费 | 166篇 |
专业分类
化学 | 763篇 |
力学 | 236篇 |
综合类 | 47篇 |
数学 | 2239篇 |
物理学 | 1267篇 |
出版年
2024年 | 4篇 |
2023年 | 83篇 |
2022年 | 74篇 |
2021年 | 60篇 |
2020年 | 78篇 |
2019年 | 104篇 |
2018年 | 95篇 |
2017年 | 142篇 |
2016年 | 125篇 |
2015年 | 104篇 |
2014年 | 272篇 |
2013年 | 307篇 |
2012年 | 196篇 |
2011年 | 260篇 |
2010年 | 245篇 |
2009年 | 286篇 |
2008年 | 280篇 |
2007年 | 276篇 |
2006年 | 237篇 |
2005年 | 176篇 |
2004年 | 151篇 |
2003年 | 141篇 |
2002年 | 107篇 |
2001年 | 83篇 |
2000年 | 83篇 |
1999年 | 66篇 |
1998年 | 57篇 |
1997年 | 67篇 |
1996年 | 51篇 |
1995年 | 46篇 |
1994年 | 40篇 |
1993年 | 24篇 |
1992年 | 29篇 |
1991年 | 19篇 |
1990年 | 19篇 |
1989年 | 24篇 |
1988年 | 18篇 |
1987年 | 10篇 |
1986年 | 17篇 |
1985年 | 18篇 |
1984年 | 15篇 |
1983年 | 4篇 |
1982年 | 9篇 |
1981年 | 8篇 |
1980年 | 8篇 |
1979年 | 8篇 |
1978年 | 4篇 |
1977年 | 8篇 |
1976年 | 5篇 |
1973年 | 2篇 |
排序方式: 共有4552条查询结果,搜索用时 46 毫秒
1.
2.
《Operations Research Letters》2022,50(2):137-144
In mine planning problems, cutoff grade optimization defines a threshold at every time period such that material above this value is processed, and the rest is considered waste. In orebodies with multiple minerals, which occur in practice, the natural extension is to consider a cutoff surface. We show that in two dimensions the optimal solution is a line, and in n dimensions it is a hyperplane. 相似文献
3.
4.
《Discrete Mathematics》2022,345(12):113083
Let G be a graph, the order of G, the connectivity of G and k a positive integer such that . Then G is said to be k-extendable if it has a matching of size k and every matching of size k extends to a perfect matching of G. A Hamiltonian path of a graph G is a spanning path of G. A bipartite graph G with vertex sets and is defined to be Hamiltonian-laceable if such that and for every pair of vertices and , there exists a Hamiltonian path in G with endpoints p and q, or and for every pair of vertices , there exists a Hamiltonian path in G with endpoints p and q. Let G be a bipartite graph with bipartition . Define to be a maximum integer such that and (1) for each non-empty subset S of X, if , then , and if , then ; and (2) for each non-empty subset S of Y, if , then , and if , then ; and (3) if there is no non-negative integer satisfying (1) and (2).Let G be a bipartite graph with bipartition such that and . In this paper, we show that if , then G is Hamiltonian-laceable; or if , then for every pair of vertices and , there is an -path P in G with . We show some of its corollaries in k-extendable, bipartite graphs and a conjecture in k-extendable graphs. 相似文献
5.
BackgroundIdentification of potential drug-target interaction pairs is very important for pharmaceutical innovation and drug discovery. Numerous machine learning-based and network-based algorithms have been developed for predicting drug-target interactions. However, large-scale pharmacological, genomic and chemical datum emerged recently provide new opportunity for further heightening the accuracy of drug-target interactions prediction.ResultsIn this work, based on the assumption that similar drugs tend to interact with similar proteins and vice versa, we developed a novel computational method (namely MKLC-BiRW) to predict new drug-target interactions. MKLC-BiRW integrates diverse drug-related and target-related heterogeneous information source by using the multiple kernel learning and clustering methods to generate the drug and target similarity matrices, in which the low similarity elements are set to zero to build the drug and target similarity correction networks. By incorporating these drug and target similarity correction networks with known drug-target interaction bipartite graph, MKLC-BiRW constructs the heterogeneous network on which Bi-random walk algorithm is adopted to infer the potential drug-target interactions.ConclusionsCompared with other existing state-of-the-art methods, MKLC-BiRW achieves the best performance in terms of AUC and AUPR. MKLC-BiRW can effectively predict the potential drug-target interactions. 相似文献
6.
Yuhua Long 《Journal of Difference Equations and Applications》2020,26(7):966-986
In the present paper, we apply the method of invariant sets of descending flow to establish a series of criteria to ensure that a second-order nonlinear functional difference equation with periodic boundary conditions possesses at least one trivial solution and three nontrivial solutions. These nontrivial solutions consist of sign-changing solutions, positive solutions and negative solutions. Moreover, as an application of our theoretical results, an example is elaborated. Our results generalize and improve some existing ones. 相似文献
7.
采用逐次阶散射法求解矢量辐射传输方程来研究气溶胶在不同地表反射模型下的散射偏振特性.首先,选取单一地表反射模型和耦合地表反射模型两种地表反射模型.然后,根据地表反射模型计算得到相应的地表反射率,进而采用逐次阶散射法对矢量辐射传输方程进行求解,得到散射光的Stokes矢量.最后,由Stokes矢量计算得出散射光的偏振度.仿真结果表明,两种地表反射模型下气溶胶单次散射的散射辐射强度和线偏振度均相等;耦合地表反射模型的总散射辐射强度和线偏振度总是大于单一地表反射模型;单一地表反射模型的气溶胶单次散射相对总散射的贡献总是大于耦合地表反射模型.研究结果对气溶胶光学特性的反演具有一定意义. 相似文献
8.
9.
《Discrete Mathematics》2020,343(2):111679
A path in an edge-colored graph is called monochromatic if any two edges on the path have the same color. For , an edge-colored graph is said to be monochromatic -edge-connected if every two distinct vertices of are connected by at least edge-disjoint monochromatic paths, and is said to be uniformly monochromatic -edge-connected if every two distinct vertices are connected by at least edge-disjoint monochromatic paths such that all edges of these paths are colored with a same color. We use and to denote the maximum number of colors that ensures to be monochromatic -edge-connected and, respectively, to be uniformly monochromatic -edge-connected. In this paper, we first conjecture that for any -edge-connected graph , , where is a minimum -edge-connected spanning subgraph of . We verify the conjecture for . We also prove the conjecture for and with . When is a minimal -edge-connected graph, we give an upper bound of , i.e., . For the uniformly monochromatic -edge-connectivity, we prove that for all , , where is a minimum -edge-connected spanning subgraph of . 相似文献
10.
《Discrete Mathematics》2020,343(12):112118